A general technique for non-blocking trees
نویسندگان
چکیده
منابع مشابه
Non-blocking k-ary Search Trees
This paper presents the first concurrent non-blocking k-ary search tree. Our data structure generalizes the recent non-blocking binary search tree of Ellen et al. [5] to trees in which each internal node has k children. Larger values of k decrease the depth of the tree, but lead to higher contention among processes performing updates to the tree. Our Java implementation uses single-word compare...
متن کاملRange Queries in Non-blocking k-ary Search Trees
We present a linearizable, non-blocking k-ary search tree (k-ST) that supports fast searches and range queries. Our algorithm uses single-word compare-and-swap (CAS) operations, and tolerates any number of crash failures. Performance experiments show that, for workloads containing small range queries, our k-ST significantly outperforms other algorithms which support these operations, and rivals...
متن کاملA Blocking Technique for EmulatingVery Large
A new Monte Carlo method for computing thermodynamical properties of very large polyelectrolytes is presented. It is based on a renormalization group relating the original polymer to a smaller system, where in addition to the naively rescaled forces, a corrective nearest-neighbor interaction originating from the short distance Coulomb cutoo is introduced. The method is derived for low T but is ...
متن کاملDeletion without Rebalancing in Non-Blocking Binary Search Trees
We present a provably linearizable and lock-free relaxed AVL tree called the non-blocking ravl tree. At any time, the height of a non-blocking ravl tree is upper bounded by logφ(2m) + c, where φ is the golden ratio, m is the total number of successful INSERT operations performed so far and c is the number of active concurrent processes that have inserted new keys and are still rebalancing the t...
متن کاملA Unified Transformation Technique for Multilevel Blocking
This paper presents a new unified method for simultaneously tiling the register and cache levels of the memory hierarchy. We will only focus on the code transformation phase of tiling. Our algorithm uses strip-mining and loop interchange on all memory hierarchy levels to determine the tiles as usual, and, afterwards, and due to the special characteristics of the register level, we apply index s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2014
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2692916.2555267